Find a flow of least cost that ships from supply sources to consumer destinations. This is a bipartite network, N = [S*T, A], where S is the set of sources, T is the set of destinations, and A is the set of arcs. In the standard form, N is bi-complete (A contains all arcs from S to T), but in practice networks tend to be sparsely linked. Let c(i, ....